Maximization Versions of “Lights Out” Games in Grids and Graphs
نویسندگان
چکیده
Complexity results and algorithms are given for the problem of maximizing the number of off vertices (switches) in graphs and m×n rectangular grids. When a switch is toggled, it and its neighbors change state. It is shown that the problem is NP-complete in graphs and a simple approximation algorithm is given as well as a nonapproximability result. Fixed-parameter problems are studied in grids and graphs and an algorithm given for m × n grids that turn at least mn − m 2 vertices off, m ≤ n. It is shown that m × n grids exist for which at most mn− m log2m vertices can be turned off.
منابع مشابه
Teaching mathematics with games and puzzles
and complete graph analogues of the Evans conjecture. [6] John Goldwasser and William Klostermeyer. Maximization versions of " lights out " games in grids and graphs.
متن کاملLights Out!: A Survey of Parity Domination in Grid Graphs
A non-empty set of vertices is called an even dominating set if each vertex in the graph is adjacent to an even number of vertices in the set (adjacency is reflexive). An odd dominating set is defined analogously. Results on parity dominating sets in grid graphs are surveyed and related results on “Lights Out!” games on grids and graphs are discussed.
متن کاملGeneralized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize the concepts used for a mathematical description of Lights Out and its relatives. Our approach uses bipartite graphs and allows for the analysis of a broader class of switch-setting games, which is demonstrated at a new...
متن کاملA study on the stability and efficiency of graphical games with unbounded treewidth
Graphical games (GG) provide compact representations of multiplayer games involving large populations of agents when influences among them have some locality property. The notion of pure Nash equilibrium (PNE), not requiring randomized strategies, is a fundamental stability concept. However, recent results show that for many natural topologies, a PNE is very unlikely to exist when the number of...
متن کاملReachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs
We study a dynamical system motivated by our earlier work [1] on the statistical physics of social balance on graphs [2, 3], that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a hypergraph; second, the “number of particles“ at a vertex of the hypergraph is an element of a finite field Zp of integers modulo p, p ≥ 3. Equivalently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007